const runtime.bitPointer
30 uses
runtime (current package)
cgocheck.go#L156: if i >= off && bits&bitPointer != 0 {
mbitmap.go#L56: bitPointer = 1 << 0
mbitmap.go#L64: bitPointerAll = bitPointer | bitPointer<<heapBitsShift | bitPointer<<(2*heapBitsShift) | bitPointer<<(3*heapBitsShift)
mbitmap.go#L539: return h.bits()&bitPointer != 0
mbitmap.go#L836: mask1 = bitPointer | bitScan // 00010001
mbitmap.go#L837: mask2 = bitPointer | bitScan | mask1<<heapBitsShift // 00110011
mbitmap.go#L838: mask3 = bitPointer | bitScan | mask2<<heapBitsShift // 01110111
mbitmap.go#L888: *h.bitp &^= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
mbitmap.go#L889: *h.bitp |= (bitPointer | bitScan) << h.shift
mbitmap.go#L892: *h.bitp |= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
mbitmap.go#L909: *h.bitp &^= (bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << h.shift
mbitmap.go#L1202: hb = (b & (bitPointer | bitPointer<<heapBitsShift)) << (2 * heapBitsShift)
mbitmap.go#L1209: *hbitp &^= uint8((bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << (2 * heapBitsShift))
mbitmap.go#L1327: *hbitp = *hbitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | uint8(hb)
mbitmap.go#L1354: *h.bitp = *h.bitp&^((bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift)<<(2*heapBitsShift)) | *src
mbitmap.go#L1380: *h.bitp = *h.bitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | *src
mbitmap.go#L1437: have = (*h.bitp >> h.shift) & (bitPointer | bitScan)
mbitmap.go#L1446: want |= bitPointer
mgcmark.go#L1296: if bits&bitPointer == 0 {